Site-directed protein recombination as a shortest-path problem
نویسندگان
چکیده
منابع مشابه
Site-directed protein recombination as a shortest-path problem.
Protein function can be tuned using laboratory evolution, in which one rapidly searches through a library of proteins for the properties of interest. In site-directed recombination, n crossovers are chosen in an alignment of p parents to define a set of p(n + 1) peptide fragments. These fragments are then assembled combinatorially to create a library of p(n+1) proteins. We have developed a comp...
متن کاملWhisker detection as a shortest path problem
In an attempt to understand how the brain encodes tactile stimuli, neuroscientists commonly investigate how rodents translate whisker motion into a sensory percept. Analysis of whisker dynamics is a challenging task. Rats, have about 30 whiskers per side and in single-viewing angle experiments, occlusion and intersection occur frequently. In this paper we present an unsupervised method for whis...
متن کاملShortest Path Problem with Gamma Probability Distribution Arc Length
We propose a dynamic program to find the shortest path in a network having gamma probability distributions as arc lengths. Two operators of sum and comparison need to be adapted for the proposed dynamic program. Convolution approach is used to sum two gamma probability distributions being employed in the dynamic program.
متن کاملThe shortest path problem
The shortest path problem is solved and applied to the calculations of half lives with respect to spontaneous fission of heavy nuclei. The dynamical programming method of Bellman and Kalaba is used to find the fission path in the d-dimensional space of deformation parameters. Fission half lives of heavy isotopes (100<Z<110) are shown and compared to the experimental data. 1. Introductory remark...
متن کاملApproximation Solutions for Time-Varying Shortest Path Problem
Abstract. Time-varying network optimization problems have tradition-ally been solved by specialized algorithms. These algorithms have NP-complement time complexity. This paper considers the time-varying short-est path problem, in which can be optimally solved in O(T(m + n)) time,where T is a given integer. For this problem with arbitrary waiting times,we propose an approximation algorithm, whic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Protein Engineering Design and Selection
سال: 2004
ISSN: 1741-0126,1741-0134
DOI: 10.1093/protein/gzh067